-
1 linear sieve algorithm
Англо-русский словарь по компьютерной безопасности > linear sieve algorithm
-
2 algorithm
алгоритм (cryptoalgorithm) криптографический алгоритм, криптоалгоритм; алгоритм шифрования (криптографического закрытия)- private cryptographic algorithmАнгло-русский словарь по компьютерной безопасности > algorithm
-
3 LMS
1) Медицина: Lund-Mackay score (шкала Ланда-Маккея)2) Американизм: Land Mitigation Strategy, Lots More Spending3) Спорт: Last Man Standing4) Военный термин: Least Means Squared, Lightweight Mortar System, Local Monitor Station, laser mapping system, lightweight millimeter-wave sensor, linear measuring system, load measurement system5) Техника: laser mass-spectrometer, least mean square, least mean square algorithm, least mean squared error, licensing management system6) Математика: Лондонское математическое общество (London Mathematical Society), линейная модульная система (linear modular system), линейное метрическое пространство (linear metric space)7) Метеорология: Light Moderate Severe8) Железнодорожный термин: Locomotive Management Services9) Сокращение: Learning Management System (2003, web based learning), Lightweight Multi-purpose Shelter, Local Monitoring Station, Logistics Management System10) Вычислительная техника: Library Maintenance System (BS2000)11) Космонавтика: Life and Microgravity Sciences (NASA Specalab mission)12) Транспорт: Le Mans Specification13) Холодильная техника: Linde molecular sieve14) Образование: Link Management System, СДО ( Система дистанционного обучения) (Learning Management System), система управления образованием, learning management system15) Сетевые технологии: Last Mile Solution, Lightweight Multicast Services, Load Memory Scan, коммутатор передачи сообщений16) Макаров: least-mean-square (algorithm)17) Расширение файла: Lotus Messaging Switch (Lotus)18) Нефть и газ: line maintenance service, line pipe maintenance station, ЛЭС, линейная эксплуатационная служба, LES19) Электротехника: load management system20) Высокочастотная электроника: location and monitoring services21) Должность: Learning Management Systems22) NYSE. The Lamson & Sessions Company
См. также в других словарях:
Sieve of Eratosthenes — Sieve of Eratosthenes: algorithm steps for primes below 121 (including optimization of starting from prime s square). In mathematics, the sieve of Eratosthenes (Greek: κόσκινον Ἐρατοσθένους), one of a number of prime number sieves, is a simple,… … Wikipedia
Quadratic sieve — The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is… … Wikipedia
Multiplication algorithm — A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use. Efficient multiplication algorithms have existed since the advent of the decimal system.… … Wikipedia
Special number field sieve — The special number field sieve (SNFS) is a special purpose integer factorization algorithm. The general number field sieve (GNFS) was derived from it.The special number field sieve is efficient for integers of the form r e plusmn; s , where r and … Wikipedia
General number field sieve — In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 100 digits. Heuristically, its complexity for factoring an integer n (consisting of log2 n bits) is of … Wikipedia
Rational sieve — In mathematics, the rational sieve is a general algorithm for factoring integers into prime factors. It is essentially a special case of the general number field sieve, and while it is far less efficient than the general algorithm, it is… … Wikipedia
Shor's algorithm — Shor s algorithm, first introduced by mathematician Peter Shor, is a quantum algorithm for integer factorization. On a quantum computer, to factor an integer N, Shor s algorithm takes polynomial time in log{N}, specifically O((log{N})^3),… … Wikipedia
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia
Timeline of mathematics — A timeline of pure and applied mathematics history. Contents 1 Before 1000 BC 2 1st millennium BC 3 1st millennium AD 4 1000–1500 … Wikipedia
Lattice problem — In computer science, lattice problems are a class of optimization problems on lattices. The conjectured intractability of such problems is central to construction of secure lattice based cryptosystems. For applications in such cryptosystems,… … Wikipedia
Quadratisches Sieb — ist ein Begriff aus dem Bereich Zahlentheorie der Mathematik und bezeichnet einen der schnellsten bekannten Algorithmen zur Faktorisierung großer natürlicher Zahlen. Es ist ein allgemeines Faktorisierungsverfahren, d.h. die Laufzeit hängt nur von … Deutsch Wikipedia